Widening Sharing
نویسندگان
چکیده
We study the problem of an efficient and precise sharing analysis of (constraint) logic programs. After recognizing that neither plain Sharing nor its non-redundant (but equivalent) abstraction scale well to real programs, we consider the domain proposed by C. Fecht [11, 12]. This domain consists of a combination of Pos with a quite weak abstraction of Sharing. While verifying that this domain is truly remarkable, in terms of both precision and efficiency, we have revealed significant precision losses for several real programs. This loss concerns groundness, pair-sharing and linearity. We define a simple domain for sharing analysis that supports the implementation of several widening techniques. In particular, with this domain it is straightforward to turn Fecht’s idea into a proper widening. More precise widenings are also considered. However, in spite of thorough experimentation we found that, provided Pos is included in the domain, the first widening we propose is hard to improve on.
منابع مشابه
Efficient Top-Down Set-Sharing Analysis Using Cliques
We study the problem of efficient, scalable set-sharing analysis of logic programs. We use the idea of representing sharing information as a pair of abstract substitutions, one of which is a worst-case sharing representation called a clique set, which was previously proposed for the case of inferring pair-sharing. We use the clique-set representation for (1) inferring actual set-sharing informa...
متن کاملNetwork-aware optimization in distributed data stream management systems
The management of streaming data in distributed environments is gaining importance in many application areas such as sensor networks and e-science. This is mainly due to both, the need for immediate reactions to important events in input streams as well as the requirement to efficiently handle enormous data volumes that are generated, for example, by modern scientific experiments and observatio...
متن کاملAdding Double Progressive Widening to Upper Confidence Trees to Cope with Uncertainty in Planning Problems
Current state of the art methods in energy policy planning only approximate the problem (Linear Programming on a finite sample of scenarios, Dynamic Programming on an approximation of the problem, etc). Monte-Carlo Tree Search (MCTS [3]) seems to be a potential candidate to converge to an exact solution of these problems ([2]). But how fast, and how do key parameters (double/simple progressive ...
متن کاملCorrectness, precision and efficiency in the sharing analysis of real logic languages
For programming languages based on logic, a knowledge of variable sharing is important; for instance, for their automatic parallelization and for many optimizations of the unification procedure, such as occurs-check reduction. Because of its usefulness, a considerable amount of research has been done on the design and development of techniques for the static analysis of variable sharing. Despit...
متن کاملGuest Editorial Spectrum Sharing and Aggregation for Future Wireless Networks, Part I
WELCOME to the IEEE JSAC special issue on Spectrum Sharing and Aggregation for Future Wireless Networks. The conception of this special issue is motivated by the following observations: the ever-increasing penetration of both the mobile Internet and of the Internet-of-things is gradually clogging up the most valuable spectral bands available in the sub-2 GHz frequency range for future wireless ...
متن کامل